#include"Sort.h"

void printArr(int* arr, int n)
{
	for (int i = 0; i < n; i++)
	{
		cout << arr[i] << ' ';
	}
	cout << endl;
}

void test()
{
	int a[] = { 1,4,3,7,9,2,5,6,8 };
	int n = sizeof(a) / sizeof(a[0]);
	//QuickSort1(a, 0, n - 1);
	MergeSort(a, n);
	printArr(a, n);
}

int main()
{
	test();


	return 0;
}